Relative Enumerability in the Diierence Hierarchy
نویسندگان
چکیده
We show that the intersection of the class of 2-REA degrees with that of the !-r.e. degrees consists precisely of the class of d.r.e. degrees. We also include some applications and show that there is no natural generalization of this result to higher levels of the REA hierarchy.
منابع مشابه
Relative enumerability in the di erence hierarchy
We show that the intersection of the class of 2-REA degrees with that of the !-r.e. degrees consists precisely of the class of d.r.e. degrees. We also include some applications and show that there is no natural generalization of this result to higher levels of the REA hierarchy.
متن کاملRelative Enumerability in the Difference Hierarchy
We show that the intersection of the class of 2-REA degrees with that of the ω-r.e. degrees consists precisely of the class of d.r.e. degrees. We also include some applications and show that there is no natural generalization of this result to higher levels of the REA hierarchy.
متن کاملOn Using Oracles That Compute Values
This paper focuses on complexity classes of partial functions that are computed in polynomial time with oracles in NPMV, the class of all multivalued partial functions that are computable nondeterministically in polynomial time. Concerning deterministic polynomial-time reducibilities, it is shown that 1. A multivalued partial function is polynomial-time computable with k adaptive queries to NPM...
متن کاملThe Monadic Quanti
The monadic second-order quantiier alternation hierarchy over the class of nite graphs is shown to be strict. The proof is based on automata theoretic ideas and starts from a restricted class of graph-like structures, namely nite two-dimensional grids. Considering grids where the width is a function of the height, we prove that the diierence between the levels k +1 and k of the monadic hierarch...
متن کاملOn Balanced vs. Unbalanced Computation Trees
A great number of complexity classes between P and PSPACE can be deened via leaf languages for computation trees of nondeterministic polynomial time machines. Jenner, McKenzie, and Th erien (Proceedings of the 9th Conference on Structure in Complexity Theory, 1994) raised the issue of whether considering balanced or unbalanced trees makes any diierence. For a number of leaf language classes, co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996